WiscSort: External Sorting for Byte-Addressable Storage

We present WiscSort, a new approach to high-performance concurrent sorting for existing and future byte-addressable storage (BAS) devices. WiscSort carefully reduces writes, exploits random reads by splitting keys values during sorting, performs interference-aware scheduling with thread pool sizing avoid I/O bandwidth degradation. introduce the BRAID model which encompasses unique characteristics of BAS Many state-of-the-art systems do not comply deliver sub-optimal performance, whereas demonstrates effectiveness complying BRAID. show that is 2-7 x faster than competing approaches on standard sort benchmark. evaluate key-value separation different sizes compare our concurrency optimizations various other models. Finally, we emulate generic devices how techniques perform well combinations hardware properties.